Projection-pursuit approach to robust linear discriminant analysis
نویسندگان
چکیده
منابع مشابه
Robust Multivariate Methods: The Projection Pursuit Approach
Projection pursuit was originally introduced to identify structures in multivariate data clouds (Huber, 1985). The idea of projecting data to a lowdimensional subspace can also be applied to multivariate statistical methods. The robustness of the methods can be achieved by applying robust estimators to the lower-dimensional space. Robust estimation in high dimensions can thus be avoided which u...
متن کاملRobust Principal Component Analysis by Projection Pursuit
Different algorithms for principal component analysis (PCA) based on the idea of projection pursuit are proposed. We show how the algorithms are constructed, and compare the new algorithms with standard algorithms. With the R implementation pcaPP we demonstrate the usefulness at real data examples. Finally, it will be outlined how the algorithms can be used for robustifying other multivariate m...
متن کاملRobust Functional Principal Components : a Projection - Pursuit Approach
In many situations, data are recorded over a period of time and may be regarded as realizations of a stochastic process. In this paper, robust estimators for the principal components are considered by adapting the projection pursuit approach to the functional data setting. Our approach combines robust projection–pursuit with different smoothing methods. Consistency of the estimators are shown u...
متن کاملRobust linear discriminant analysis using S-estimators
The authors consider a robust linear discriminant function based on high breakdown location and covariance matrix estimators. They derive influence functions for the estimators of the parameters of the discriminant function and for the associated classification error. The most B-robust estimator is determined within the class of multivariate S-estimators. This estimator, which minimizes the max...
متن کاملRobust Linear Discriminant Trees
We present a new method for the induction of classiication trees with linear dis-criminants as the partitioning function at each internal node. This paper presents two main contributions: rst, a novel objective function called soft entropy which is used to identify optimal coeecients for the linear discriminants, and second, a novel method for removing outliers called iterative re-ltering which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Multivariate Analysis
سال: 2010
ISSN: 0047-259X
DOI: 10.1016/j.jmva.2010.06.017